Toward a machine-certified correctness proof of Wand's type reconstruction algorithm
نویسندگان
چکیده
Although there are machine-certified proofs of correctness of Alg. W and Alg. J, the correctness proof of Wand’s type reconstruction has never been machine checked. We give here a brief description of our attempt at machine-certified proof of correctness of Wand’s algorithm. The correctness is essentially given in terms of completeness and soundness with respect to the Hindley-Milner type system. Unlike other works, we do not axiomatize MGUs.
منابع مشابه
A Dependently Typed Programming Language, with applications to Foundational Certified Code Systems
Certified code systems enable trust to be generated in untrusted pieces of code. This is done by requiring that a machine–verifiable certificate be packaged with code, which can then be proved safe independently. Safety is defined with respect to a defined safety policy. Recent work has focused on “foundational certified code systems”, which define the safety policy as execution on a concrete m...
متن کاملTowards Certified Data Flow Analysis of Business Processes
Data flow analysis allows for the static analysis of business processes. Certified data flow analysis would even allow for a trustwhorty analysis, as the analysis comes with a machine-checkable correctness proof. In this paper, we argue for a certified analysis of business processes.
متن کاملDeveloping Certified Program Verifiers with a Proof Assistant
I describe ongoing work on a new approach to foundational proof-carrying code. The key new idea is to use certified program verifiers to embody customized program verification strategies, specialized to particular safety policies, enforcement mechanisms, and source-level compilers. A certified verifier is an executable program that has a full correctness proof. The particular strategy that I’ve...
متن کاملCertified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose. In this paper, we present an algebraic specification, implementation, and proof of correctness of a generalisation of Valiant’s algorithm. The generalisation can be used for recognition, parsing or generic calculation of...
متن کاملModular Development of Certified Program Verifiers with a
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove memory safety of x86 machine code programs compiled from code that uses algebraic datatypes. The tool’s soundness theorem is expressed in terms of the bit-level semantics of x86 programs, so its correctness depends on ve...
متن کامل